SEN - R 9832 December 1998
نویسنده
چکیده
In this paper we describe an experiment in which MANIFOLD is used to coordinate the interprocess communication in a parallelized proposition solver. MANIFOLD is very well suited for applications involving dynamic process creation and dynamically changing (ir)regular communication patterns among sets of independent concurrent cooperating processes. The idea in this case study is simple. The proposition solver consists of a fixed numbers of separate processing units which communicate with each other such that the output of one serves as the input for the other. Because one of the processing units performs a computation intensive job, we introduce a master/worker protocol to divide its computations. We show that this protocol implemented in MANIFOLD adds another hierarchic layer to the application but leaves the previous layers intact. This modularity of MANIFOLD offers the possibility to introduce concurrency step by step. We also verify the implementation of the proposition solver using a simple family of assertions and give some performance results. 1991 Computing Reviews Classification System: D.3.3, D.1.3, D.3.2, F.1.2, D.2.1. 1991 Mathematics Subject Classification System: 68N15, 68Q10.
منابع مشابه
Kaluza-Klein and H-Dyons in String Theory
Kaluza-Klein monopole and H-monopole solutions, which are T-dual to each other, are the well-known solutions of string theory compactified on T . Since string theory in this case has an S-duality symmetry, we explicitly construct the corresponding dyonic solutions by expressing the D = 4 string effective action in a manifestly SL(2, R) invariant form with an SL(2, R) invariant constraint. The S...
متن کاملA global optimization algorithm for solving the minimum multiple ratio spanning tree problem
This paper studies the sum-of-ratios version of the classical minimum spanning tree (MST) problem. We develop a branch-and-bound algorithm for solving the general version of the problem based on its image space representation. The suggested approach specifically addresses the difficulties arising in the case when the number of ratios exceeds two. The efficacy of our approach is demonstrated on ...
متن کاملEncoding toroidal triangulations
Poulalhon and Schaeffer introduced an elegant method to linearly encode a planar triangulation optimally. The method is based on performing a special depth-first search algorithm on a particular orientation of the triangulation: the minimal Schnyder wood. Recent progress toward generalizing Schnyder woods to higher genus enables us to generalize this method to the toroidal case. In the plane, t...
متن کاملFeature subset selection for logistic regression via mixed integer optimization
This paper concerns a method of selecting a subset of features for a logistic regression model. Information criteria, such as the Akaike information criterion and Bayesian information criterion, are employed as a goodness-offit measure. The feature subset selection problem is formulated as a mixed integer linear optimization problem, which can be solved with standard mathematical optimization s...
متن کامل